Papers with sentence representation
DynaMaR: Dynamic Prompt with Mask Token Representation (2022.emnlp-industry)
Copied to clipboard
Xiaodi Sun, Sunny Rajagopalan, Priyanka Nigam, Weiyi Lu, Yi Xu, Iman Keivanloo, Belinda Zeng, Trishul Chilimbi
| Challenge: | Recent research shows that large language models pretrained using unsupervised approaches can achieve significant performance improvement on many downstream tasks. |
| Approach: | They propose an unsupervised approach to fine-tuning large language models using unsupervised approaches to many downstream tasks. |
| Outcome: | The proposed approach improves on four e-commerce applications and can achieve an average improvement of 10% in few-shot settings and 3.7% in data-rich settings over the standard approach. |
Collecting Diverse Natural Language Inference Problems for Sentence Representation Evaluation (D18-1)
Copied to clipboard
Adam Poliak, Aparajita Haldar, Rachel Rudinger, J. Edward Hu, Ellie Pavlick, Aaron Steven White, Benjamin Van Durme
| Challenge: | a plethora of new natural language inference datasets has been created in recent years . however, these datasets do not provide clear insight into what type of reasoning or inference a model may be performing. |
| Approach: | They propose to recast 13 existing natural language inference datasets into a common structure. |
| Outcome: | The proposed datasets provide insight into how well a sentence representation captures distinct types of reasoning. |
ListOps: A Diagnostic Dataset for Latent Tree Learning (N18-4)
Copied to clipboard
| Challenge: | Existing work on latent tree learning models shows they do not learn plausible grammars . a dataset is created to study the parsing ability of such models in natural language . |
| Approach: | They propose a toy dataset to study the parsing ability of latent tree learning models . they propose 'listops' toy that has a single correct parse strategy that a system needs to learn . |
| Outcome: | The proposed model outperforms existing models on sentence understanding tasks . it can learn grammars that conform to plausible semantics and syntactic formalisms . |
AugCSE: Contrastive Sentence Embedding with Diverse Augmentations (2022.aacl-main)
Copied to clipboard
| Challenge: | Similar work has shown that a single augmentation can be used to learn a robust generalpurpose representation with contrastive learning. |
| Approach: | They propose a unified framework to utilize diverse sets of data augmentations to achieve a better, general-purpose sentence embedding model. |
| Outcome: | The proposed framework achieves state-of-the-art results on downstream transfer tasks and performs competitively on semantic textual similarity tasks, using only unsupervised data. |
Adopting the Word-Pair-Dependency-Triplets with Individual Comparison for Natural Language Inference (C18-1)
Copied to clipboard
| Challenge: | Existing approaches to perform natural language inference ignore syntactic dependency among words or use tree-LSTM to generate sentence representation with irrelevant information. |
| Approach: | They propose to perform natural language inference with Word-Pair-Dependency-Triplets . they propose to compare the triplets of a given passage-pair to make judgement more interpretable . |
| Outcome: | The proposed approach is better than most of the approaches that use tree structures and comparable to other state-of-the-art approaches. |
Sentence Representations via Gaussian Embedding (2024.eacl-short)
Copied to clipboard
| Challenge: | Sentence embeddings represent a sentence's meaning as a point in a vector space and primarily use symmetric measures such as the cosine similarity to measure the similarity between sentences, they cannot capture asymmetric relationships between two sentences, such as entailment and hierarchical relations. |
| Approach: | They propose a Gaussian-distribution-based contrastive learning framework for sentence embedding that can handle asymmetric inter-sentential relations and a similarity measure for identifying entailment relations. |
| Outcome: | The proposed framework performs comparable to that of previous methods on natural language inference tasks and estimates direction of entailment relations, which is difficult with point representations. |
Self-Attention Enhanced CNNs and Collaborative Curriculum Learning for Distantly Supervised Relation Extraction (D19-1)
Copied to clipboard
| Challenge: | Distantly Supervised Relation Extraction (DSRE) suffers from mislabelled data . human annotation on large datasets is costly and often impossible . |
| Approach: | They propose a model that employs a collaborative curriculum learning framework to reduce mislabelled data. |
| Outcome: | The proposed model outperforms baselines including state-of-the-art in terms of P@N and PR curve metrics on a widely-used public dataset. |
Compressing Sentence Representation for Semantic Retrieval via Homomorphic Projective Distillation (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing pre-trained language models produce large sentence embeddings, resulting in performance gap between large and small models. |
| Approach: | They propose a method that augments a small Transformer encoder model with learnable projection layers to produce compact sentences while mimicking a large pre-trained language model to retain the sentence representation quality. |
| Outcome: | The proposed method achieves 2.7-4.5 points performance gain on STS and SR tasks while maintaining the quality of the pre-trained language models. |
Graph Enhanced Dual Attention Network for Document-Level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Document-level relation extraction requires inter-sentence reasoning capabilities to capture local and global contextual information for multiple relation facts. |
| Approach: | They propose to characterize the interaction between sentences and potential relation instances via a Graph Enhanced Dual Attention network (GEDA) . they also propose a simple yet effective regularizer based on the natural duality of the S2R and R2S attentions, whose weights are also supervised by the supporting evidence of relation instances during training. |
| Outcome: | The proposed model achieves competitive performance on an existing large-scale dataset while the predictions can be interpretable and easily observed. |
Improving Multi-label Emotion Classification via Sentiment Classification with Dual Attention Transfer Network (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to emotion detection are lexicon-based, graphical model-based and linear classifier-based. |
| Approach: | They propose a transfer learning architecture to divide sentence representation into two different feature spaces which capture general sentiment words and other important emotion-specific words via a dual attention mechanism. |
| Outcome: | The proposed model can capture general sentiment words and other emotion-specific words via a dual attention mechanism on two benchmark datasets. |
Enhancing Sentence Embedding with Generalized Pooling (C18-1)
Copied to clipboard
| Challenge: | Existing methods for learning sentence embedding are limited, but still need to be improved. |
| Approach: | They propose a vector-based multi-head attention model that uses special cases of max pooling, mean pooling and scalar self-attention. |
| Outcome: | The proposed model improves on natural language inference, author profiling, and sentiment classification tasks. |
Neural Machine Translation with Reordering Embeddings (P19-1)
Copied to clipboard
| Challenge: | Existing work exploits the reordering information in neural machine translation . experimental results show that the proposed methods can significantly improve the performance of the transformer translation system. |
| Approach: | They propose a reordering mechanism to learn the re ordering embedding of a word based on contextual information and stack them together with self-attention networks to learn sentence representation for machine translation. |
| Outcome: | The proposed method improves translation performance on English-to-German, NIST Chinese-to English, and WAT Japanese-toEnglish translation tasks. |
Alleviating Over-smoothing for Unsupervised Sentence Representation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to learn better unsupervised sentence representations have been successful . over-smoothing problem in unsupervised sentences reduces the capacity of powerful PLMs . |
| Approach: | They propose a method to solve the over-smoothing problem in unsupervised sentence representations by combining negatives from PLMs intermediate layers. |
| Outcome: | The proposed method improves on different strong baselines on Semantic Textual Similarity and Transfer datasets. |
C3LPGCN:Integrating Contrastive Learning and Cooperative Learning with Prompt into Graph Convolutional Network for Aspect-based Sentiment Analysis (2024.findings-naacl)
Copied to clipboard
| Challenge: | Recent studies have shown that graph convolutional networks (GCNs) can model syntactic information but incorrect syntaktic structure may introduce additional noise. |
| Approach: | They propose a graph convolutional network which integrates Contrastive Learning and Cooperative Learning with Prompt into GCN to alleviate the noise when modeling syntactic information. |
| Outcome: | The proposed model outperforms state-of-the-art models on three datasets and significantly outperformed existing models. |
Modularized Syntactic Neural Networks for Sentence Classification (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for sentence classification use local information of sub-trees, but new models use global context . |
| Approach: | They propose a tree-parallel mini-batch strategy for efficient training and predicting sentences . they propose to use syntax category labels to model sub-trees . |
| Outcome: | The proposed model outperforms state-of-the-art tree-based methods on the sentence classification task. |
InfoCSE: Information-aggregated Contrastive Learning of Sentence Embeddings (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies on contrastive learning for sentence embeddings are weak . researchers have started to use contrastive training to learn better unsupervised sentences. |
| Approach: | They propose an information-aggregated contrastive learning framework for learning unsupervised sentence embeddings. |
| Outcome: | The proposed framework outperforms SimCSE on several benchmark datasets w.r.t the semantic text similarity task. |
Discourse Self-Attention for Discourse Element Identification in Argumentative Student Essays (2020.emnlp-main)
Copied to clipboard
| Challenge: | Despite its importance, discourse element identification is challenging due to the ambiguity of sentences . the number of elaboration sentences could be 10 times more than the number edna sentences. |
| Approach: | They propose to use sentence positional encodings to explicitly represent sentence positions and inter-sentence attentions to capture sentence interactions and enhance sentence representation. |
| Outcome: | The proposed model improves on a Chinese and English dataset. |
INSET: Sentence Infilling with INter-SEntential Transformer (2020.acl-main)
Copied to clipboard
| Challenge: | Missing sentence generation fosters a wide range of applications in natural language generation . Developing models for sentence infilling can potentially facilitate many text generation applications . |
| Approach: | They propose a framework to decouple the problem from natural language processing . they propose generating missing sentences that can syntactically and semantically bridge context . |
| Outcome: | The proposed model learns a sentence representation and generates 'missing sentences' the proposed model can be used for document auto-completion and meeting note expansion . |
Multi-layer Representation Fusion for Neural Machine Translation (C18-1)
Copied to clipboard
| Challenge: | Neural machine translation systems require a number of stacked layers for deep models, but the prediction depends on the sentence representation of the top-most layer with no access to low-level representations. |
| Approach: | They propose a multi-layer representation fusion approach to fusing stacked layers to learn a better representation from the stack. |
| Outcome: | The proposed approach yields 0.92 and 0.56 BLEU points over the strong Transformer baseline on IWSLT German-English and NIST Chinese-English MT tasks respectively. |
Scientific Paper Extractive Summarization Enhanced by Citation Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | citation graphs can be used to extract scientific papers under different conditions. |
| Approach: | They propose a multi-granularity unsupervised summarization model that fine tunes a pre-trained encoder model on the citation graph by link prediction tasks. |
| Outcome: | The proposed model outperforms baseline models on a public benchmark dataset. |
Investigating Dynamic Routing in Tree-Structured LSTM for Sentiment Analysis (D19-1)
Copied to clipboard
| Challenge: | Existing deep neural network models such as LSTM and tree-LSTM have a bias problem where the words in the tail of a sentence are more heavily emphasized than those in the header. |
| Approach: | They propose a capsule tree-LSTM model that uses dynamic routing to build sentence representations by assigning different weights to nodes according to their contributions to prediction. |
| Outcome: | The proposed model improves on the Stanford Sentiment Treebank and EmoBank datasets. |
Contrastive Learning with Adversarial Examples for Alleviating Pathology of Language Model (2023.acl-long)
Copied to clipboard
| Challenge: | Existing interpretation methods fail to obtain faithful attributions on these models, thereby failing to reveal potential flaws and biases. |
| Approach: | They propose a Contrastive learning regularization method which calibrates the sentence representation of out-of-distribution examples and utilizes adversarial examples to introduce direction information in regularization. |
| Outcome: | The proposed method alleviates the model pathology while impacting generalization ability on in-distribution examples and thus helps interpretation methods obtain more faithful results. |
Similarizing the Influence of Words with Contrastive Learning to Defend Word-level Adversarial Text Attack (2023.findings-acl)
Copied to clipboard
| Challenge: | Neural language models are vulnerable to word-level adversarial text attacks . previous word-based search methods assume important words influence prediction . |
| Approach: | They propose a method for similarizing the influence of words with contrast learning that encourages model to learn sentence representations in which words of varying importance have a more uniform influence on prediction. |
| Outcome: | The proposed method is compatible with various training methods and improves model robustness against various adversarial attacks. |
Identifying Domain Adjacent Instances for Semantic Parsers (D18-1)
Copied to clipboard
| Challenge: | Semantic parsers map text to logical forms, which can then be used by downstream components to fulfill an action. |
| Approach: | They propose a simple sentence representation that emphasizes unexpected words . they formalize domain-adjacency problem and propose logical form representations . |
| Outcome: | The proposed approach improves the performance of a downstream semantic parser on in-domain and domain-adjacent instances. |
PromptBERT: Improving BERT Sentence Embeddings with Prompts (2022.emnlp-main)
Copied to clipboard
Ting Jiang, Jian Jiao, Shaohan Huang, Zihan Zhang, Deqing Wang, Fuzhen Zhuang, Furu Wei, Haizhen Huang, Denvy Deng, Qi Zhang
| Challenge: | Existing research shows that BERT and RoBERTa are poor in sentence embeddings due to static token embeddable bias and ineffective BERT layers. |
| Approach: | They propose a novel contrastive learning method for better sentence embeddings by using a template denoising technique. |
| Outcome: | The proposed method achieves 2.29 and 2.58 points of improvement compared to SimCSE and RoBERTa in the unsupervised setting. |
CE-DA: Custom Embedding and Dynamic Aggregation for Zero-Shot Relation Extraction (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods to predict relationships with given entity pairs are lacking in supervised methods. |
| Approach: | They propose a framework for zero-shot Relation Extraction that includes two modules: Custom Embedding and Dynamic Aggregation. |
| Outcome: | The proposed framework shows competitive performance on two ZSRE datasets. |
Improving Zero-shot Multilingual Neural Machine Translation by Leveraging Cross-lingual Consistency Regularization (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to improve zero-shot translation performance by learning language-agnostic representations and maximizing cross-lingual transfer have been proposed. |
| Approach: | They propose a cross-lingual consistency regularization to bridge the representation gap between different languages and boost zero-shot translation performance. |
| Outcome: | The proposed model improves translation performance on low-resource and high-res benchmarks and closes the sentence representation gap and aligns the representation space. |
MEXMA: Token-level objectives improve sentence representations (2025.acl-long)
Copied to clipboard
| Challenge: | Current approaches to cross-lingual sentence encoders use sentence-level objectives only. |
| Approach: | They propose a novel approach that integrates both sentence-level and token-level objectives. |
| Outcome: | The proposed approach outperforms existing CLSEs on bitext mining tasks and downstream tasks. |
AmpleHate: Amplifying the Attention for Versatile Implicit Hate Detection (2025.emnlp-main)
Copied to clipboard
| Challenge: | Current approaches to detect hate speech rely on contrastive learning to distinguish hate from non-hate sentences. |
| Approach: | They propose a novel approach to detect implicit hate speech by identifying explicit targets . they use a pretrained Named Entity Recognition model to capture explicit target information . |
| Outcome: | The proposed approach outperforms current methods and achieves faster convergence. |